package cn.cnsuh.剑指offer.q29_顺时针打印矩阵;

public class Main {
    public static void main(String[] args) {
        int[][] matrix = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
        int[] res = fun2(matrix);

        for (int re : res) {
            System.out.print(re);
        }

    }

    static int[] fun2(int[][] matrix) {
        if (matrix.length == 0) return new int[0];
        int l = 0, r = matrix[0].length - 1, t = 0, b = matrix.length - 1, x = 0;
        int[] res = new int[(r + 1) * (b + 1)];
        while(true){
            for (int i = l; i <= r ; i++) {
                res[x++] = matrix[t][i];
            }
            if(++t>b) break;
            for (int i = t; i <= b ; i++) {
                res[x++] = matrix[i][r];
            }
            if(--r<l) break;
            for (int i = r; i >= l ; i--) {
                res[x++] = matrix[b][i];
            }
            if(--b< t) break;
            for (int i = b; i >= t ; i--) {
                res[x++] = matrix[i][l];
            }
            if(++l>r) break;
        }

        return res;
    }























    static int[] spiralOrder(int[][] matrix) {
        if (matrix.length == 0) return new int[0];
        int l = 0, r = matrix[0].length - 1, t = 0, b = matrix.length - 1;
        int[] res = new int[(r + 1) * (b + 1)];
        //从左到右。从上到下
        int x = 0;
        while (true) {
            for (int i = l; i <= r; i++) {
                res[x++] = matrix[t][i];
            }
            if (++t > b) break;
            for (int i = t; i <= b; i++) {
                res[x++] = matrix[i][r];
            }
            if (--r < l) break;
            for (int i = r; i >= l; i--) {
                res[x++] = matrix[b][i];
            }
            if (--b < t) break;
            for (int i = b; i >= t; i--) {
                res[x++] = matrix[i][l];
            }
            if (++l > r) break;
        }
        return res;
    }
}
